Zero Sets of Smooth Functions in the Pfaffian Closure of an O-minimal Structure
نویسنده
چکیده
I show that in an o-minimal structure on the real field, satisfying certain conditions, every closed definable set is the zero set of a smooth definable function. The conditions are shown to hold in the Pfaffian closure of a polynomially bounded o-minimal structure having smooth cell decomposition.
منابع مشابه
Generating the Pfaffian closure with total Pfaffian functions
Given an o-minimal expansion R of the real field, we show that the structure obtained from R by iterating the operation of adding all total Pfaffian functions over R defines the same sets as the Pfaffian closure of R . 2010 Mathematics Subject Classification 14P10,03C64 (primary); 58A17 (secondary)
متن کاملRelative Closure and the Complexity of Pfaffian Elimination
We introduce the “relative closure” operation on one-parametric families of semi-Pfaffian sets. We show that finite unions of sets obtained with this operation (“limit sets”) constitute a structure, i.e., a Boolean algebra closed under projections. Any Pfaffian expression, i.e., an expression with Boolean operations, quantifiers, equations and inequalities between Pfaffian functions, defines a ...
متن کاملTopological Complexity of the Relative Closure of a Semi-Pfaffian Couple
Gabrielov introduced the notion of relative closure of a Pfaffian couple as an alternative construction of the o-minimal structure generated by Khovanskii’s Pfaffian functions. In this paper, use the notion of format (or complexity) of a Pfaffian couple to derive explicit upper-bounds for the homology of its relative closure.
متن کاملComplexity of Computations with Pfaffian and Noetherian Functions
This paper is a survey of the upper bounds on the complexity of basic algebraic and geometric operations with Pfaffian and Noetherian functions, and with sets definable by these functions. Among other results, we consider bounds on Betti numbers of sub-Pfaffian sets, multiplicities of Pfaffian intersections, effective Lojasiewicz inequality for Pfaffian functions, computing frontier and closure...
متن کاملOn the Number of Connected Components of the Relative Closure of a Semi-Pfaffian Family
The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functions. In this paper, an effective bound is given for the number of connected components of (X, Y )0 in terms of the Pfaffian complexity of X and Y.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008